A Note on Coloring Line Arrangements

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Coloring Line Arrangements

We show that the lines of every arrangement of n lines in the plane can be colored with O( √ n/ log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a Θ( √ log n) factor. Any further improvement on this bound would also improve the best known lower bound on the following problem of Erdős: estimate the maximum number of points in general po...

متن کامل

Coloring Complexes and Arrangements

Steingrimsson’s coloring complex and Jonsson’s unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a large class of unipolar complexes have convex ear decompositions. These convex ear decompositions impose strong new restrictions on the chromatic polynomials of all finite graphs.

متن کامل

Coloring and Guarding Arrangements

Given an arrangement of lines in the plane, what is the minimum number c of colors required to color the lines so that no cell of the arrangement is monochromatic? In this paper we give bounds on the number c, as well as some of its variations. We cast these problems as characterizing the chromatic and the independence numbers of a new family of geometric hypergraphs.

متن کامل

A Note on Shellability of Hypergraph Arrangements

For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown to have shellable intersection lattices.

متن کامل

On Invariant Line Arrangements

We classify all arrangements of lines that are invariant under foliations of degree 4 of the real projective plane.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2014

ISSN: 1077-8926

DOI: 10.37236/2660